Improving ICP with easy implementation for free-form surface matching
نویسنده
چکیده
Automatic range image registration and matching is an attractive but unresolved problem in both the machine vision and pattern recognition literature. Since automatic range image registration and matching is inherently a very difficult problem, the algorithms developed are becoming more and more complicated. In this paper, we propose a novel practical algorithm for automatic free-form surface matching. This method directly manipulates the possible point matches established by the traditional ICP criterion based on both the collinearity and closeness constraints without any feature extraction, image pre-processing, or motion estimation from outliers corrupted data. A comparative study based on a large number of real range images has shown the accuracy and robustness of the novel algorithm.
منابع مشابه
Multi-feature matching algorithm for free-form 3D surface registration
Applications such as object digitizing, object recognition and object inspection need efficient surface matching algorithms. Several variants of an iterative closest point (ICP) matching algorithm have been proposed for such tasks. This paper proposes and analyzes a multi-feature ICP matching algorithm that includes the surface color and the surface orientation information. The matching error m...
متن کاملFree form surface matching using motion consistency
In this paper, we propose a novel algorithm to evaluate the possible point matches established by the traditional ICP algorithm in the process of matching two overlapping free form surfaces represented as two sets of unorganised points. While the existing methods mainly use feature matching to establish or evaluate possible correspondences between the surfaces to be matched, our novel approach ...
متن کاملGenetic algorithms for free-form surface matching
The free-form surface matching problem is important in several practical applications, such as reverse engineering. An accurate, robust and fast solution is, therefore, of great significance. Recently genetic algorithms have attracted great interest for their ability to robustly solve hard optimization problems. In this work we investigate the performance of such an approach for finding the ini...
متن کاملNumerical study of flow of labyrinth weir with triangular and curved plan form using Fluent software
Labyrinth weirs have not a straight crest in the perpendicular direction to the flow. The plan view of the weir consists of multiple and broken linear crests that cause the increase of its effective length. The advantages of this type of weirs are higher discharge capacity, easy aeration as well as low fluctuations of water surface at the weir upstream. This paper deals with the simulation of t...
متن کاملMarker-free Automatic Matching of Range Data
Matching of multiple views is often addressed in 3D-model generation and is normally a two-stage process consisting of a coarse and a fine matching stage. Coarse matching, that is the pre-alignment of the surfaces for the complex forms, which can be positioned far away from each other in 3D space, is a difficult problem to solve. Fine matching on the other hand can be performed accurately using...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition
دوره 37 شماره
صفحات -
تاریخ انتشار 2004